Axiomatisability Problems for S-acts, Revisited
نویسنده
چکیده
This paper discusses necessary and sufficient conditions on a monoid S, such that a class D of left S-acts is first order axiomatisable. Such questions have previousely been considered by Bulman-Fleming, Gould, Stepanova and others. Let C be a class of embeddings of right S-acts. A left S-act B is C-flat if tensoring with any B ∈ D preserves the embeddings in C. We find one or two (depending on a property of C) sets of necessary and sufficient conditions on S such that class of all C-flat left S-acts is axiomatisable. These results are similar to those of Gould and Shaheen for S-posets. The general results use “replacement tossings”. Further we show how to axiomatise some classes using both replacement tossings and interpolation conditions, this throwing some light on the former technique.
منابع مشابه
On Some Finitary Conditions Arising from the Axiomatisability of Certain Classes of Monoid Acts
This article considers those monoids S satisfying one or both of the finitary properties (R) and (r), focussing for the most part on inverse monoids. These properties arise from questions of axiomatisability of classes of S-acts, and appear to be of interest in their own right. If S weakly right noetherian (WRN), that is, S has the ascending chain condition on right ideals, then certainly (r) h...
متن کاملAxiomatisability of free, projective and flat S-acts
We survey the known results characterising those monoids S such that the classes of free, projective or (weakly, strongly) flat S-acts are first order axiomatisable. The conditions on the monoid S that arise are finitary, and intricately related. We examine their inter-connections and illustrate the independence of certain pairs.
متن کاملPREPRINT SERIES 2010 / 2011 NO : 8 TITLE : ‘ AXIOMATISABILITY PROBLEMS FOR S - POSETS ’ AUTHOR ( S ) : Dr Victoria Gould
Let C be a class of ordered algebras of a given fixed type τ . Associated with the type is a first order language Lτ , which must also contain a binary predicate to be interpreted by the ordering in members of C. One can then ask the question, when is the class C axiomatisable by sentences of Lτ? In this paper we will be considering axiomatisability problems for classes of left S-posets over a ...
متن کاملAxiomatisability Problems for S-posets
Let C be a class of ordered algebras of a given fixed type τ . Associated with the type is a first order language Lτ , which must also contain a binary predicate to be interpreted by the ordering in members of C. One can then ask the question, when is the class C axiomatisable by sentences of Lτ? In this paper we will be considering axiomatisability problems for classes of left S-posets over a ...
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010